CS Proofs (Extended Abstracts)

نویسنده

  • Silvio Micali
چکیده

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Translating nonstandard proofs to constructive ones

From 09.01.05 to 14.01.05, the Dagstuhl Seminar 05021 Mathematics, Algorithms, Proofs was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results an...

متن کامل

Algebraic and Numerical Algorithms and Computer-assisted Proofs Dagstuhl Seminar

From 25.09.05 to 30.09.05, the Dagstuhl Seminar 05391 Algebraic and Numerical Algorithms and Computer-assisted Proofs was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as...

متن کامل

A computer-assisted proof for stable/unstable behaviour of periodic solutions for the forced damped pendulum

From 15.11. to 20.11.2009, the Dagstuhl Seminar 09471 Computer-assisted proofs tools, methods and applications was held in Schloss Dagstuhl Leibniz Center for Informatics. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and...

متن کامل

Presenting Machine-Found Proofs

This paper outlines an implemented system named PROVERB that transforms and abstracts machine-found proofs to natural deduction style proofs at an adequate level of abstraction and then verbalizes them in natural language. The abstracted proofs, originally employed only as an intermediate representation, also prove to be useful for proof planning and proving by analogy.

متن کامل

Efficient Proofs on Committed Graphs and NP - Statements

Digital signature schemes are a foundational building block enabling integrity and non-repudiation. We propose a graph signature scheme and corresponding proofs that allow a prover (1) to obtain a signature on a committed graph and (2) to subsequently prove to a verifier knowledge of such a graph signature. The graph signature scheme and proofs are a building block for certification systems tha...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1994